Formal Semantics and Soundness of an Algorithm
نویسندگان
چکیده
This paper presents an algorithm for executing formal speci cations, and a proof of the soundness of that algorithm. The algorithm executes speci cations written in the model-based speci cation language SPECS-C++ by transforming such speci cations to constraint programs. The generated programs use constraint satisfaction techniques to execute speci cations written at a high level of abstraction. Denotational semantics techniques are used for both explaining the algorithm and for proving its soundness.
منابع مشابه
Descriptive Typing Rules for Xcerpt
We present typing rules for the Web query language Xcerpt. The rules provide a descriptive type system: the typing of a program is an approximation of its semantics. The rules can also be seen as an abstract form of a type inference algorithm (presented in previous work), and as a stage in a formal soundness proof of the algorithm. The paper considers a substantial fragment of Xcerpt; the main ...
متن کاملProving Java Type Soundness
This technical report describes a machine checked proof of the type soundness of a subset of the Java language called JavaS . A formal semantics for this subset has been developed by Drossopoulou and Eisenbach, and they have sketched an outline of the type soundness proof. The formulation developed here complements their written semantics and proof by correcting and clarifying signi cant detail...
متن کاملA Comparison of Soundness Results Obtained by Different Approaches
Business processes are often modelled using a language for which no semantics is standardized in a formal way. Examples for such languages are BPMN or Event-Driven Process Chains (EPC). The common way for reasoning about the soundness of such models is to define a formal semantics first by translating the model into a well-founded formalism (for example Petri-nets). Afterwards, formal reasoning...
متن کاملCompile - time detection of information ow
We give a formal deenition of the notion of information ow for a simple guarded command language. We propose an axiomatisation of security properties based on this notion of information ow and we prove its soundness with respect to the operational semantics of the language. We then identify the sources of non determinism in proofs and we derive in successive steps an inference algorithm which i...
متن کاملA Theory of Featherweight Java in Isabelle/HOL
We formalize the type system, small-step operational semantics, and type soundness proof for Featherweight Java [1], a simple object calculus, in Isabelle/HOL [2].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014